Path graph

Results: 1083



#Item
281NP-complete problems / Cograph / Tree decomposition / Clique / Graph / Tree / Minor / Cycle rank / Path decomposition / Graph theory / Graph operations / Graph coloring

When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2012-06-17 02:27:41
282Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
283Graph / Tree / Shortest path problem / Degree / Planar separator theorem / Chordal graph / Graph theory / Mathematics / Theoretical computer science

An effective 3-in-1 keyword search method over heterogeneous data sources

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 08:02:06
284Evolving networks / Scale-free network / Degree distribution / Average path length / Clustering coefficient / Social network / Network science / Barabási–Albert model / Graph theory / Network theory / Networks

work’s links were simply determined by a completely random process. • The degree distribution of networks tends to exhibit “fat tails” and often approximate a “scalefree” or “power-law” distribution. Thus

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2004-05-26 01:42:25
285Automated planning and scheduling / Pebble motion problems / Tree decomposition / Algorithm / Graph pebbling / Graph coloring / Graph theory / Mathematics / Theoretical computer science

Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author:

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
286Operations research / Graph theory / Mathematical optimization / NP-complete problems / Network theory / Algorithm / Shortest path problem / Dynamic programming / Graph / Theoretical computer science / Mathematics / Applied mathematics

ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2005-05-26 20:09:03
287NP-complete problems / Hamiltonian path / Icosahedron / Combination puzzles / Puzzles / Line graph / N-dimensional sequential move puzzle / Graph theory / Theoretical computer science / Mathematics

On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:52
288Topological graph theory / Network theory / Planar graphs / Algebraic graph theory / Matroid theory / Shortest path problem / Dual graph / Graph embedding / Matroid / Graph theory / Mathematics / Theoretical computer science

Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-06-23 07:19:49
289Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Theoretical computer science / Graph theory / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:24
290Network theory / Routing algorithms / Planar separator theorem / Shortest path problem / Distance / Induced path / Tree / NP-complete problems / Path decomposition / Graph theory / Mathematics / Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
UPDATE